Soliton-Like LT Codes over GF(4) and GF(8)
نویسندگان
چکیده
The Luby Transform (LT) codes are the first practical realization of fountain codes. LT codes were designed for efficient use over erasure channels. However, the degree distributions designed for the Binary Erasure Channel (BEC), such as the Robust Soliton Distribution (RSD) which are asymptotically and universally optimal over the BEC, are not optimal over noisy channels. Research has been done to improve performance over noisy channels and in finite length codes by changing the degree distribution or information sampling method. Many distributions that performed better than the RSD still shared some of its properties. These distributions fit under the umbrella of soliton-like distributions. In this work, we consider using non-binary LT codes to improve the Bit Error Rate (BER) and realized rate of the system with an acceptable increase in complexity. While testing different degree distributions on 4-ary and 8-ary LT code, the RSD was not performing well. This led to the design of the fundamental degree distribution (FDD), which falls under the category of soliton-like distributions. The parameters for this distribution are found through Monte Carlo numerical optimization. This new degree distribution was able to show improvements when moving to higher order fields in terms of BER and realized rate. It is clear that there is added complexity when moving to higher order fields. Some
منابع مشابه
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملSpectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity...
متن کاملAn Upper Bound for Self-Dual Codes
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) and GF(3) can have. We give an explicit formula for this weight distribution when the minimum distance d between codewords is made as large as possible. It follows that for self-dual codes of length n over GF(2) with all weights divisible by 4, d ~ 4[n/24] + 4; and for self-dual codes over GF(3), ...
متن کاملOptimal Four-Dimensional Codes over GF(8)
We prove the nonexistence of several four-dimensional codes over GF(8) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure of subcodes. The specific parameters of the codes ruled out are: [111, 4, 96], [110, 4, 95], [102, 4, 88], [101, 4, 87], [93, 4, 80], and the sequence [29 − j, 4, 24 − j], for j = 0, 1, 2.
متن کاملQuantum codes from cyclic codes over GF(4m)
We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF (4)) starting from cyclic codes over GF (4). We also provide examples of these codes some of which meet the known bounds for quantum codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016